Minimum asymptotic error of algorithms for solving ODE
نویسندگان
چکیده
منابع مشابه
METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملMinimum Probability of Error-Based Equalization Algorithms for Fading Channels
Novel channel equalizer algorithms are introduced for wireless communication systems to combat channel distortions resulting from multipath propagation. The novel algorithms are based on newly derived bounds on the probability of error (PE) and guarantee better performance than the traditional zero forcing (ZF) or minimum mean square error (MMSE) algorithms. The new equalization methods require...
متن کاملDecomposition algorithms for solving the minimum weight maximal matching problem
We investigate the problem of finding a maximal matching that has minimum total weight on a given edge-weighted graph. Although the minimum weight maximal matching problem is NP-hard in general, polynomial time exact or approximation algorithms on several restricted graph classes are given in the literature. In this paper, we propose an exact algorithm for solving several variants of the proble...
متن کاملLearning Curves for Error Minimum and Maximum Likelihood Algorithms
For the problem of dividing the space originally pad tionec ~y a blurred boundary, every learning algorithm can make the probability of incorrect prediction of an individual example E decrease with the number of training examples t. We address here the question of how the asymptotic form of ~ ( t ) as well as its limit of convergence reflect the choice of learning algorithms. The error minimum ...
متن کاملSimple ODE Solvers - Error Behaviour
y(t0) = y0 Here f(t, y) is a given function, t0 is a given initial time and y0 is a given initial value for y. The unknown in the problem is the function y(t). Two obvious considerations in deciding whether or not a given algorithm is of any practical value are (a) the amount of computational effort required to execute the algorithm and (b) the accuracy that this computational effort yields. Fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1988
ISSN: 0885-064X
DOI: 10.1016/0885-064x(88)90016-7